Network Coding and 2 Matroid Theory 3 This paper explores the connection between network coding and matroid theory , 4 a branch of mathematics that generalizes

نویسنده

  • Kenneth Zeger
چکیده

2 Matroid Theory 3 This paper explores the connection between network coding and matroid theory, 4 a branch of mathematics that generalizes linear algebra and graph theory. ABSTRACT | Networks derived from matroids have played a 7 fundamental role in proving theoretical results about the limits 8 of network coding. In this tutorial paper, we review many con-9 nections between matroids and network coding theory, with 10 specific emphasis on network solvability, admissible network 11 alphabet sizes, linear coding, and network capacity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Network Coding and 2 Matroid Theory 3 This paper explores the connection between network coding and Matroid theory

2 Matroid Theory 3 This paper explores the connection between network coding and Matroid theory, 4 a branch of mathematics that generalizes linear algebra and graph theory. ABSTRACT | Networks derived from matroids have played a 7 fundamental role in proving theoretical results about the limits 8 of network coding. In this tutorial paper, we review many con-9 nections between matroids and netwo...

متن کامل

This paper explores the connection between network coding and matroid theory , a branch of mathematics that generalizes linear algebra and graph theory

| Networks derived from matroids have played a fundamental role in proving theoretical results about the limits of network coding. In this tutorial paper, we review many connections between matroids and network coding theory, with specific emphasis on network solvability, admissible network alphabet sizes, linear coding, and network capacity.

متن کامل

Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory

The aim of this workshop was to bring together experts and students from pure and applied mathematics, computer science, and engineering, who are working on related problems in the areas of matroid theory, combinatorial optimization, coding theory, secret sharing, network coding, and information inequalities. The goal was to foster exchange of mathematical ideas and tools that can help tackle s...

متن کامل

Matroids, generalized networks, and electric network synthesis

Matroid theory has been applied to solve problems in generalized assignment, operations research, control theory, network theory, flow theory, generalized flow theory or linear programming, coding theory, and telecommunication network design. The operations of matroid union, matroid partitioning, matroid intersection, and the theorem on the greedy algorithm, Rado’s theorem, and Brualdi’s symmet...

متن کامل

Simpler Self-reduction Algorithm for Matroid Path-width

Path-width of matroids naturally generalizes better known path-width of graphs, and is NP-hard by a reduction from the graph case. While the term matroid path-width was formally introduced by Geelen–Gerards–Whittle [JCTB 2006] in pure matroid theory, it was soon recognized by Kashyap [SIDMA 2008] that it is the same concept as long-studied so called trellis complexity in coding theory, later na...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011